Games with guaranteed scores and waiting moves

Combinatorial scoring games, with the property ‘extra pass moves for a player will do him no harm’, are characterized. The characterization involves an order embedding of Conway’s normal play games, and we call our class the universe of Guaranteed scoring games. Also, we give a theorem for comparing guaranteed games with scores (numbers) which extends Ettinger’s work on Dicot scoring games.     

Optimization of Fishing Strategies in Space and Time as a Non-convex Optimal Control Problem

The behavior of a fishing fleet and its impact onto the biomass of fish can be described by a nonlinear parabolic diffusion–reaction equation. Looking for an optimal fishing strategy leads to a non-convex optimal control problem with a bilinear control action. In this work, we present such an optimal control formulation, prove its well-posedness and derive first- and second-order optimality conditions. These results provide a basis for tailored finite element discretization as well as for Newton type optimization algorithms. First numerical test problems show typical features as so-called No-Take-Zones and maximal fishing quota (total allowable catches) as parts of an optimal fishing strategy.     

Higher dimensional Apollonian packings,revisited

The Apollonian circle and sphere packings are well known objects that have attracted the attention of mathematicians throughout the ages. The historically natural generalization of the procedure for generating the packing breaks down in higher dimensions, as it leads to overlapping hyperspheres. There is, however, an alternative interpretation that allows one to extend the concept to higher dimensions and in a unique way. For relatively small dimensions (2 through at least 8), those packings can be thought of as ample cones for classes of K3 surfaces. We describe the packings in some detail for dimensions 4 (with plenty of pictures), 5, and 6.     

On the Strong Convergence of Subgradients of Convex Functions

In this paper, results on the strong convergence of subgradients of convex functions along a given direction are presented; that is, the relative compactness (with respect to the norm) of the union of subdifferentials of a convex function along a given direction is investigated.     

Diversity-oriented synthesis and antifungal activities of novel pimprinine derivative bearing a 1,3,4-oxadiazole-5-thioether moiety

Molecular Diversity - Based on the strategy of diversity-oriented synthesis and the structures of natural product pimprinine and streptochlorin, two series of novel pimprinine derivatives...     

Reflections on and of minor-closed classes of multisorted operations

The minor relation of functions is generalized to multisorted functions. Pippenger’s Galois theory for minor-closed sets of functions is extended to multisorted functions and multisorted relation pairs. Reflections of minor-closed sets are again minor-closed, and the effect of reflections on the invariant relation pairs of minor-closed sets of multisorted functions is described.     

Another refinement of the right-hand side of the Hermite–Hadamard inequality for simplices

We establish a new refinement of the right-hand side of the Hermite–Hadamard inequality for convex functions of several variables defined on simplices.     

Constrained Extremum Problems and Image Space Analysis–Part I: Optimality Conditions

Image space analysis is a new tool for studying scalar and vector constrained extremum problems as well as generalized systems. In the last decades, the introduction of image space analysis has shown that the image space associated with the given problem provides a natural environment for the Lagrange theory of multipliers and that separation arguments turn out to be a fundamental mathematical tool for explaining, developing and improving such a theory. This work, with its 3 parts, aims at contributing to describe the state-of-the-art of image space analysis for constrained optimization and to stress that it allows us to unify and generalize the several topics of optimization. In this 1st part, after a short introduction of such an analysis, necessary and sufficient optimality conditions are treated. Duality and penalization are the contents of the 2nd part. The 3rd part deals with generalized systems, in particular, variational inequalities and Ky Fan inequalities. Some further developments are discussed in all the parts.     

Consistency requirements and pattern methods in cost sharing problems with technological cooperation

Using the discrete cost sharing model with technological cooperation, we investigate the implications of the requirement that demand manipulations must not affect the agents’ shares. In a context where the enforcing authority cannot prevent agents (who seek to reduce their cost shares) from splitting or merging their demands, the cost sharing methods used must make such artifices unprofitable. The paper introduces a family of rules that are immune to these demand manipulations, the pattern methods. Our main result is the characterization of these methods using the above requirement. For each one of these methods, the associated pattern indicates how to combine the technologies in order to meet the agents’ demands. Within this family, two rules stand out: the public Aumann–Shapley rule, which never rewards technological cooperation; and the private Aumann–Shapley rule, which always rewards technology providers. Fairness requirements imposing natural bounds (for the technological rent) allow to further differentiate these two rules.     

Leading-edge flow criticality as a governing factor in leading-edge vortex initiation in unsteady airfoil flows

A leading-edge suction parameter (LESP) that is derived from potential flow theory as a measure of suction at the airfoil leading edge is used to study initiation of leading-edge vortex (LEV) formation in this article. The LESP hypothesis is presented, which states that LEV formation in unsteady flows for specified airfoil shape and Reynolds number occurs at a critical constant value of LESP, regardless of motion kinematics. This hypothesis is tested and validated against a large set of data from CFD and experimental studies of flows with LEV formation. The hypothesis is seen to hold except in cases with slow-rate kinematics which evince significant trailing-edge separation (which refers here to separation leading to reversed flow on the aft portion of the upper surface), thereby establishing the envelope of validity. The implication is that the critical LESP value for an airfoil–Reynolds number combination may be calibrated using CFD or experiment for just one motion and then employed to predict LEV initiation for any other (fast-rate) motion. It is also shown that the LESP concept may be used in an inverse mode to generate motion kinematics that would either prevent LEV formation or trigger the same as per aerodynamic requirements.